Permutation polynomials and their differential properties over residue class rings

نویسندگان

  • Yuyin Yu
  • Mingsheng Wang
چکیده

This paper mainly focuses on permutation polynomials over the residue class ring ZN , where N > 3 is composite. We have proved that for the polynomial f(x) = a1x 1 + · · · + akx with integral coefficients, f(x) mod N permutes ZN if and only if f(x) mod N permutes Sμ for all μ | N , where Sμ = {0 < t < N : gcd(N, t) = μ} and SN = S0 = {0}. Based on it, we give a lower bound of the differential uniformities for such permutation polynomials, that is, δ(f) ≥ N #Sa , where a is the biggest nontrivial divisor of N . Especially, f(x) can not be APN permutations over the residue class ring ZN . It is also proved that f(x) mod N and (f(x) + x) mod N can not permute ZN at the same time when N is even.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some new results on permutation polynomials over finite fields

Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, four classes of monomial complete permutation polynomials and one class of trinomial complete permutation polynomials are presented, one of which confirms a conjecture proposed by Wu et al. (Sci. China Math., to appear. Doi: 10.1007/s11425-...

متن کامل

On Inverses for Quadratic Permutation Polynomials over Integer Rings

Quadratic permutation polynomial interleavers over integer rings have recently received attention in practical turbo coding systems from deep space applications to mobile communications. In this correspondence, a necessary and sufficient condition that determines the least degree inverse of a quadratic permutation polynomial is proven. Moreover, an algorithm is provided to explicitly compute th...

متن کامل

LDPC Convolutional Codes Based on Permutation Polynomials over Integer Rings

A novel algebraic construction technique for LDPC convolutional codes (LDPCCCs) based on permutation polynomials over integer rings is presented. The underlying elements of this construction technique are graph automorphisms and quasi-cyclic (QC) codes. The algebraic structure of the obtained LDPCCCs, their encoding and decoding are discussed. These new codes have a special structure, which is ...

متن کامل

Some New Permutation Polynomials over Finite Fields

In this paper, we construct a new class of complete permutation monomials and several classes of permutation polynomials. Further, by giving another characterization of opolynomials, we obtain a class of permutation polynomials of the form G(x) + γTr(H(x)), where G(X) is neither a permutation nor a linearized polynomial. This is an answer to the open problem 1 of Charpin and Kyureghyan in [P. C...

متن کامل

NONNIL-NOETHERIAN MODULES OVER COMMUTATIVE RINGS

In this paper we introduce a new class of modules which is closely related to the class of Noetherian modules. Let $R$ be a commutative ring with identity and let $M$ be an $R$-module such that $Nil(M)$ is a divided prime submodule of $M$. $M$ is called a Nonnil-Noetherian $R$-module if every nonnil submodule of $M$ is finitely generated. We prove that many of the properties of Noetherian modul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 161  شماره 

صفحات  -

تاریخ انتشار 2013